class Solution:
def maxValue(self, n: str, x: int) -> str:
ans = ""
flag = 0
if n[0] == "-":
for i in range( 1, len(n),1):
if flag == 1:
ans += n[i]
continue
if int(n[i]) > x:
ans += str(x)
ans += n[i]
flag = 1
else:
ans += n[i]
if flag == 0:
ans += str(x)
return "-" + ans
else:
for i in range(len(n)):
if flag == 1:
ans += n[i]
continue
if int(n[i]) < x:
ans += str(x)
ans += n[i]
flag = 1
else:
ans += n[i]
if flag == 0:
ans += str(x)
return ans36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |